On the Number of Trace-One Elements in Polynomial Bases for F2n
نویسندگان
چکیده
This paper investigates the number of trace-one elements in a polynomial basis for F2n . A polynomial basis with a small number of trace-one elements is desirable because it results in an efficient and lowcost implementation of the trace function. We focus on the case where the reduction polynomial is a trinomial or a pentanomial, in which case field multiplication can also be efficiently implemented.
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کامل#P- and $\oplus$P- completeness of counting roots of a sparse polynomial
Consider the field F2n . Its elements are presented as polynomials from F2[x] modulo some irreducible polynomial of degree n. This polynomial can be found in time polynomial in n, as well as the matrix that related two representation corresponding to different irreducible polynomials [2]. Therefore, we do not need to specify a choice of the irreducible polynomial speaking about polynomial reduc...
متن کاملOn constant products of elements in skew polynomial rings
Let $R$ be a reversible ring which is $alpha$-compatible for an endomorphism $alpha$ of $R$ and $f(X)=a_0+a_1X+cdots+a_nX^n$ be a nonzero skew polynomial in $R[X;alpha]$. It is proved that if there exists a nonzero skew polynomial $g(X)=b_0+b_1X+cdots+b_mX^m$ in $R[X;alpha]$ such that $g(X)f(X)=c$ is a constant in $R$, then $b_0a_0=c$ and there exist nonzero elements $a$ and $r$ in $R$ such tha...
متن کاملA Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases
In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 37 شماره
صفحات -
تاریخ انتشار 2005